Sequential optimality conditions for cardinality-constrained optimization problems with applications

نویسندگان

چکیده

Abstract Recently, a new approach to tackle cardinality-constrained optimization problems based on continuous reformulation of the problem was proposed. Following this approach, we derive problem-tailored sequential optimality condition, which is satisfied at every local minimizer without requiring any constraint qualification. We relate condition an existing M-type stationary concept by introducing weak qualification cone-continuity property. Finally, present two algorithmic applications: improve results for known regularization method proving that it generates limit points satisfying aforementioned conditions even if subproblems are only solved inexactly. And show that, under suitable Kurdyka–?ojasiewicz-type assumption, point standard (safeguarded) multiplier penalty applied directly reformulated also satisfies condition. These stronger than corresponding ones related class mathematical programs with complementarity constraints.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization

Sequential optimality conditions for constrained optimization are necessarily satisfied by local minimizers, independently of the fulfillment of constraint qualifications. These conditions support the employment of different stopping criteria for practical optimization algorithms. On the other hand, when an appropriate strict constraint qualification associated with some sequential optimality c...

متن کامل

On sequential optimality conditions for smooth constrained optimization

Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Approximate KKT and Approximate Gradient Projection conditions are analyzed in this work. These conditions are not necessarily equivalent. Implications between different conditions and counter-examples will be shown. Algorithmic consequences will be discussed.

متن کامل

Optimality Conditions and Complexity for Non-Lipschitz Constrained Optimization Problems

In this paper, we consider a class of nonsmooth, nonconvex constrained optimization problems where the objective function may be not Lipschitz continuous and the feasible set is a general closed convex set. Using the theory of the generalized directional derivative and the Clarke tangent cone, we derive a first order necessary optimality condition for local minimizers of the problem, and define...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Optimization and Applications

سال: 2021

ISSN: ['0926-6003', '1573-2894']

DOI: https://doi.org/10.1007/s10589-021-00298-z